Limit Theorems for the Number of Summands in Integer Partitions
نویسنده
چکیده
Central and local limit theorems are derived for the number of distinct summands in integer partitions, with or without repetitions, under a general scheme essentially due to Meinardus. The local limit theorems are of the form of Cramér-type large deviations and are proved by Mellin transform and the two-dimensional saddle-point method. Applications of these results include partitions into positive integers, into powers of integers, into integers [jβ], β > 1, into aj + b, etc.
منابع مشابه
The Limit Shape and Fluctuations of Random Partitions of Naturals with Fixed Number of Summands
We consider the uniform distribution on the set of partitions of integer n with c √ n numbers of summands, c > 0 is a positive constant. We calculate the limit shape of such partitions, assuming c is constant and n tends to infinity. If c → ∞ then the limit shape tends to known limit shape for unrestricted number of summands (see reference [11]). If the growth is slower than √ n then the limit ...
متن کاملGeneral Moment Theorems for Non-distinct Unrestricted Partitions
A well-known result from Hardy and Ramanujan gives an asymptotic expression for the number of possible ways to express an integer as the sum of smaller integers. In this vein, we consider the general partitioning problem of writing an integer n as a sum of summands from a given sequence Λ of non-decreasing integers. Under suitable assumptions on the sequence Λ, we obtain results using associate...
متن کاملPartitions Into
§1 . Asymptotic estimates for the number of partitions of the integer n into summands chosen from an arithmetic progression have been derived by several authors, see for example Meinardus [3] . In this note we investigate a natural extension which has not previosusly appeared in the literature . We shall study the asymptotic behaviour of the numbers p a a (n) and q (n), the number of partitions...
متن کاملOn the enumeration of partitions with summands in arithmetic progression
Enumerating formulae are constructed which count the number of partitions of a positive integer into positive summands in arithmetic progression with common difference D. These enumerating formulae (denoted pD(n)) which are given in terms of elementary divisor functions together with auxiliary arithmetic functions (to be defined) are then used to establish a known characterisation for an intege...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 96 شماره
صفحات -
تاریخ انتشار 2001